A Linear Algebraic Attack on the AAFG1 Braid Group Cryptosystem
نویسنده
چکیده
Our purpose is to describe a promising linear algebraic attack on the AAFG1 braid group cryptosystem proposed in [2] employing parameters suggested by the authors. Our method employs the well known Burau matrix representation of the braid group and techniques from computational linear algebra and provide evidence which shows that at least a certain class of keys are weak. We argue that if AAFG1 is to be viable the parameters must be fashioned to defend against this attack.
منابع مشابه
On the Security of the Cha-Ko-Lee-Han-Cheon Braid Group Public Key Cryptosystem
At the CRYPTO 2000 conference the seminal KLCHKP (Ko-Lee-CheonHan-Kang-Park) braid group public-key cryptosystem was published see [2]. An updated version of the KLCHKP cryptosystem which is the CKLHC (ChaKo-Lee-Han-Cheon) braid group cryptosystem was introduced at ASIACRYPT 2001 conference [10] the claim of the authors was the updated cryptosystem is based on the DH-DP (Diffie-Hellman Decompos...
متن کاملAspects of Nonabelian Group Based Cryptography: A Survey and Open Problems
Most common public key cryptosystems and public key exchange protocols presently in use, such as the RSA algorithm, Diffie-Hellman, and elliptic curve methods are number theory based and hence depend on the structure of abelian groups. The strength of computing machinery has made these techniques theoretically susceptible to attack and hence recently there has been an active line of research to...
متن کاملA Strong Blind Signature Scheme over Braid Groups
The rapid development of quantum computing makes public key cryptosystems not based on commutative algebraic systems hot topic. Because of the non-commutativity property, the braid group with braid index more than two becomes a new candidate for constructing cryptographic protocols. A strong blind signature scheme is proposed based on the difficulty of the one-more matching conjugacy problem in...
متن کاملLength-Based Attacks for Certain Group Based Encryption Rewriting Systems
In this note, we describe a probabilistic attack on public key cryptosystems based on the word/conjugacy problems for finitely presented groups of the type proposed recently by Anshel, Anshel and Goldfeld. In such a scheme, one makes use of the property that in the given group the word problem has a polynomial time solution, while the conjugacy problem has no known polynomial solution. An examp...
متن کاملA Geometric and Algebraic Description of Annular Braid Groups
We provide a new presentation for the annular braid group. The annular braid group is known to be isomorphic to the finite type Artin group with Coxeter graph Bn. Using our presentation, we show that the annular braid group is a semidirect product of an infinite cyclic group and the affine Artin group with Coxeter graph Ãn−1. This provides a new example of an infinite type Artin group which inj...
متن کامل